# 找出唯一不重复的

# list1=[1,2,2,1,3]
# list2=list(set(list1))
# print(list2)
#
# def func1():
#     for i in list2:
#         c=0
#         for j in list1:
#             if j==i:
#                 c+=1
#         if c==1:
#             return i
# print(func1())


# 求第h次弹起的高度 和第n次弹起总高度
# h=input('请输入h的高度')
# def func(h,n):
#     a1=h/3
#     an=a1*(1/3**(n-1))
#     sn=(a1-an*(1/3))/(1-1/3)
#     print(an,sn)

# import time
# s=time.time()
# # lst=[]
# # for i in range(1,1000001):
# #     lst.append(i)
# lst=[i for i in range(1,1000001)]
# e=time.time()
# print(e-s)
#
# a=0.11046886444091797
# b=0.0468904972076416

# 1. 青蛙跳台阶
# 一只青蛙一次可以跳上一级台阶 也可以跳上两级台阶
# 问：如果一个n级台阶有多少种跳法？
# def fib(n):
#     if n == 1:
#         return 1
#     if n == 2:
#         return 2
#     if n > 2:
#         return fib(n-1) + fib(n-2)
#
# def jump(m):
#     if m == 1:
#         return 1
#     if m ==2 :
#         return 2
#     if m > 2:
#         return fib(m-1) + fib(m-2)
# print(jump(6))

# 2. 给定一个列表，和一个数，求列表中哪个索引位置的元素之和与给定的这个数相等
# [1,2,3,4,6,7]
# def func(lst,target):
#     for i in lst:
#         for j in lst[lst.index(i)+1:]:
#
#             if j == target - i:
#                 print(lst.index(i),end=' ')
#                 print(lst.index(j))
# func([1,2,3,4,6,7],10)


# 3. 给4个数1,2,3,4能组成多少个不重复的三味数
# def func(lst):
#     total = 0
#     for i in lst:
#         for j in lst:
#             for k in lst:
#                 if i != j and i != k and j != k:
#                     total +=1
#     print(total)
# func([1,2,3,4])

# 4. 给定一个数组，判断其内元重复元素，有重复元素返回False,无重复元素返回True
lst=[1,2,3,4,3]
def func3(a):
    b= set(a)
    return  len(b) == len(a)
print(func3(lst))